منابع مشابه
1 Binary Greedy Codes
In this paper, we provide a simpler proof of a previously known result about greedily generated binary codes. We consider the mapping g: Vn ⇒ Vm, which sends binary vectors to their gvalues obtained from a B-ordering. We show that g is a homomorphism via a proof by induction on gvalues. The proof depends on a previous result that the set of vectors having g-value 0 is a linear code. We also dis...
متن کامل1 Self Orthogonal Greedy Codes
In this paper, we examine greedily generated self orthogonal codes. We show that they are linear, and discuss several properties which they possess. We also look at specific examples of these codes.
متن کاملGreedy Generation of Non-Binary Codes
We get a B-ordering of all binary n-tuples Vn by choosing an ordered basis {y1,...,yn} of Vn and ordering the n-tuples as follows: 0, y1, y2, y2+y1, y3, y3+y1, y3+y2, y3+y2+y1, y4,... Given a minimum distance d, choose a set of vectors S with the zero vector first, then go through the vectors in their Bordering and choose the next vector which has distance d or more from all vectors already cho...
متن کاملGreedy Construction of DNA Codes and New Bounds
In this paper, we construct linear codes over Z4 with bounded GCcontent. The codes are obtained using a greedy algorithm over Z4. Further, upper and lower bounds are derived for the maximum size of DNA codes of length n with constant GC-content w and edit distance d. keywords: DNA codes, GC-content, edit distance, upper and lower bounds.
متن کاملGreedy and Heuristic Algorithms for Codes and Colorings
Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the motivation to improve lower bounds on the sizes of constant weight codes and asymmetric codes, we suggest a few greedy algorithms and other heuristic methods, which result in new, record-breaking codes. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1993
ISSN: 0097-3165
DOI: 10.1016/0097-3165(93)90085-m